Multi-Mode Measures: From Potholes to Police
نویسندگان
چکیده
منابع مشابه
Potholes in the Road to Information Quality
hen spring finally comes to New England, it brings with it gaping holes in roads. The larger of these potholes are patched, but the road can never be made smooth again. Smaller potholes, although a daily nuisance, are often not repaired at all. Something similar is happening in the area of information systems: People who need information to accomplish their tasks are finally being provided with...
متن کاملLandscapes with Tiles and Potholes
SWAT (Soil and Water Assessment Tool) is a watershed model that has been incorporated into USEPA’s modeling framework called BASINS used for total maximum daily load (TMDL) analysis. It is thus important that SWAT realistically simulate tile flow and pothole landscapes that are common in much of the Corn Belt and Great Lakes states. In this study, SWAT was modified to simulate water table dynam...
متن کاملThe Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem
This paper presents the formulation and solution of the Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem. The focus of the proposed method is not on finding a single optimal solution, instead on presenting multiple feasible solutions, with cost and duration information to the project manager. The motivation for developing such an approach is due in part to practica...
متن کاملPotholes on the Royal Road
It is still unclear how an evolutionary algorithm (EA) searches a fitness landscape, and on what fitness landscapes a particular EA will do well. The validity of the building-block hypothesis, a major tenet of traditional genetic algorithm theory, remains controversial despite its continued use to justify claims about EAs. This paper outlines a research program to begin to answer some of these ...
متن کاملMulti-processor Exact Procedures for Regular Measures of the Multi-mode RCPSP
The multi-mode resource-constrained project scheduling problem (MM RCPSP) is an NP-hard problem representing a generalization of the well-studied RCPSP. Depth-first tree search approach by Sprecher & Drexl (1998) is the best-known exact solution tree search procedure for this problem. In this paper we modify an existing breadth-first algorithm for multiple processors. It is a computer-cluster i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Public Productivity Review
سال: 1976
ISSN: 0361-6681
DOI: 10.2307/3379874